package leetCode.solution;

import java.util.PriorityQueue;

public class Solution904 {

	public static void main(String[] args) {
		  PriorityQueue<Integer> queue = new PriorityQueue<>((o1,o2) -> o2 - o1);//降序
		        queue.offer(1);
		        queue.offer(2);
		        queue.offer(3);
		        queue.offer(4);
		        queue.offer(5);
		        queue.offer(6);
		        while (!queue.isEmpty()){
		            System.out.print(queue.poll() + " ");
		        }
		    }

}
